import java.util.Scanner;

public class testDemo {
    //打印x图形
    public static void func(int n) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if(i==j){
                    System.out.print("*");
                }else if (i+j==n-1){
                    System.out.print("*");
                }else{
                    System.out.print(" ");
                }
            }
            System.out.println();
        }
    }
    public static void main1(String[] args) {
        Scanner scan=new Scanner(System.in);
        while (scan.hasNextInt()){
            int n=scan.nextInt();
            func(n);
        }
    }
//打印素数
    public static void main2(String[] args) {
        int i = 1;
        while (i <= 100) {
            int j = 2;
            int flg = 1;                        //定义一个标志来记录，1代表质数，0代表合数。
            while (j <= (int) Math.sqrt(i)) {
                if (i % j == 0) {
                    flg = 0;
                    break;
                }
                j++;
            }
            switch (flg) {
                case 1:
                    System.out.print(i + " ");
                    break;
                default:
                    break;
            }
            i++;
        }
    }
//输出每一位数
       public static void print(int n) {
        int tmp=0;
       while(n!=0){
           tmp=n%10;
           n=n/10;
           System.out.println(tmp);
       }
}
       public static void main3(String[] args) {
           Scanner scan=new Scanner(System.in);
           int n=scan.nextInt();
           print(n);
}
//找出出现一次的数字
public static void main4(String[] args) {
        int[]array={1,2,3,2,1};
        int sum=array[0];
    for (int i = 1; i <array.length ; i++) {
        sum=sum^ array[i];
    }
    System.out.println(sum);
}
//奇数在前，偶数在后
    public static void main5(String[] args) {
            int[]array={1,2,3,4,5};
            int left=0;
            int right=array.length-1;
            while(left<right){
                while(left<right&&array[left]%2!=0){
                   left++;
                }
                while(left<right&&array[right]%2==0){
                    right--;
                }
                int tmp=array[left];
                array[left]=array[right];
                array[right]=tmp;
            }
        for (int i = 0; i < array.length; i++) {
            System.out.println(array[i]+"");
        }
    }
    //求2个数最大值
    public static int max2(int a,int b) {
    return a>b?a:b;
    }

    public static int max3(int a,int b,int c) {
       return max2(max2(a,b),c);
    }

    public static void main(String[] args) {
        System.out.println(max3(1,2,3));
    }
}






















